12 research outputs found
Parameter-Independent Strategies for pMDPs via POMDPs
Markov Decision Processes (MDPs) are a popular class of models suitable for
solving control decision problems in probabilistic reactive systems. We
consider parametric MDPs (pMDPs) that include parameters in some of the
transition probabilities to account for stochastic uncertainties of the
environment such as noise or input disturbances.
We study pMDPs with reachability objectives where the parameter values are
unknown and impossible to measure directly during execution, but there is a
probability distribution known over the parameter values. We study for the
first time computing parameter-independent strategies that are expectation
optimal, i.e., optimize the expected reachability probability under the
probability distribution over the parameters. We present an encoding of our
problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem
to computing optimal strategies in POMDPs.
We evaluate our method experimentally on several benchmarks: a motivating
(repeated) learner model; a series of benchmarks of varying configurations of a
robot moving on a grid; and a consensus protocol.Comment: Extended version of a QEST 2018 pape
Accelerated Model Checking of Parametric Markov Chains
Parametric Markov chains occur quite naturally in various applications: they
can be used for a conservative analysis of probabilistic systems (no matter how
the parameter is chosen, the system works to specification); they can be used
to find optimal settings for a parameter; they can be used to visualise the
influence of system parameters; and they can be used to make it easy to adjust
the analysis for the case that parameters change. Unfortunately, these
advancements come at a cost: parametric model checking is---or rather
was---often slow. To make the analysis of parametric Markov models scale, we
need three ingredients: clever algorithms, the right data structure, and good
engineering. Clever algorithms are often the main (or sole) selling point; and
we face the trouble that this paper focuses on -- the latter ingredients to
efficient model checking. Consequently, our easiest claim to fame is in the
speed-up we have often realised when comparing to the state of the art
Scenario-Based Verification of Uncertain MDPs
Contains fulltext :
219401.pdf (publisher's version ) (Open Access)TACAS 202
Synthesis in pMDPs: A Tale of 1001 Parameters
Contains fulltext :
197721.pdf (preprint version ) (Closed access)Communicating multi-pushdown systems model networks of multi-threaded recursive programs communicating via reliable FIFO channels. We extend the notion of split-width [8] to this setting, improving and simplifying the earlier definition. Split-width, while having the same power of clique-/tree-width, gives a divide-and-conquer technique to prove the bound of a class, thanks to the two basic operations, shuffle and merge, of the split-width algebra. We illustrate this technique on examples. We also obtain simple, uniform and optimal decision procedures for various verification problems parametrised by split-width.Automated Technology for Verification and Analysis: 16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 201
Experiments for 'Scenario-Based Verification of Uncertain Parametric MDPs'
This artifact accompanies the 2022 article in the International Journal on Software Tools for Technology Transfer (STTT) with the same title
Structured Synthesis for Probabilistic Systems
Contains fulltext :
204626.pdf (preprint version ) (Closed access)
Contains fulltext :
204626pub.pdf (publisher's version ) (Closed access)NASA Formal Methods: 11th International Symposium, NFM 2019, Houston, TX, USA, May 7–9, 201